Stanford Number Theory Learning Seminar
نویسنده
چکیده
In the course of Deligne’s proof of the purity theorem, he makes certain monodromy constructions which do not a priori yield legitimate `-adic sheaves. In order to make the proof work, it therefore becomes necessary to slightly enlarge the category of sheaves considered from `-adic (constructible) sheaves to Weil sheaves. These satisfy very similar formal properties to ordinary `-adic sheaves, and the Grothendieck-Lefschetz trace formula remains valid in this context. Then, using this formalism, it becomes possible to analyze the sheaves that are actually relevant to the proof, and to demonstrate that they are in fact `-adic sheaves in the ordinary sense. Now, fix a scheme X0 of finite type1 over a finite field k = Fq and an algebraic closure k2, and let X = X0 ×k k with π : X → X0 the projection morphism. Let F : α 7→ α be the geometric Frobenius automorphism of k, which topologically generates Gal(k/k).
منابع مشابه
Number Theory Learning Seminar Perfectoid Spaces
These are informal notes of all the lectures released throughout the 2014-2015 Number Theory Learning Seminar at Stanford. For more details on the aim of the course, please refer to the syllabus, available at http://math.stanford.edu/∼conrad/Perfseminar/refs/Syllabus1415.pdf. Throughout the text, the references are cited as in the syllabus. Part I Adic Spaces 1 Lecture 1: Motivation for adic sp...
متن کاملLearning from private and public observations of others' actions
We study the diffusion of dispersed private information in a large economy. We assume that agents learn from the actions of others through both a private channel, which represents learning from local interactions, and a public channel, which represents learning from prices. We show that the private and public channels of information diffusion generate different learning dynamics and welfare imp...
متن کاملLecture 3: Reduction Theory Ii Lecture by Brian Conrad Stanford Number Theory Learning Seminar
Example 3. For k′/k a finite separable extension and H any linear algebraic k-group, we have H ↪−→ Rk′/k(Hk′) =: H ′, where Rk′/k(Hk′) is the Weil restriction functor (which is representable by a linear algebraic k-group). This functor is defined by Rk′/k(Hk′)(A) = Hk′(A⊗k k′), so the injection H ↪−→ Rk′/k(Hk′) is given by sending a k-morphism SpecA→ H to its base change by k′. Then we have [H ...
متن کاملBequests as Signals: An Explanation for the Equal Division Puzzle
In the United States, more than two-thirds of decedents with multichild families divide their estates exactly equally among their children. In contrast, intra vivos gifts are usually unequal. These findings challenge the validity of existing theories regarding the determination of intergenerational transfers. In this paper, we develop a theory that accounts for this puzzle, based on the notion ...
متن کاملExploration and Curiosity in Robot Learning and Inference (Dagstuhl Seminar 11131)
Reasoning about Interaction: From Game Theory to Logic and Back (Dagstuhl Seminar 11101) Jürgen Dix, Wojtek Jamroga, and Dov Samet . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Computational Geometry (Dagstuhl Seminar 11111) Pankaj Kumar Agarwal, Kurt Mehlhorn, and Monique Teillaud . . . . . . . . . . . . . . . . . . 19 Computational Complexity of Discrete Problems (...
متن کاملTheory of Randomized Optimization Heuristics
This report summarizes the talks, breakout sessions, and discussions at the Dagstuhl Seminar 17191 on Theory of Randomized Optimization Heuristics, held during the week from May 08 until May 12, 2017, in Schloss Dagstuhl – Leibniz Center for Informatics. The meeting is the successor of the “Theory of Evolutionary Algorithm” seminar series, where the change in the title reflects the development ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017